Message Routing Algorithm with Additional Node-Information for Capability-Aware Object Management in P2P Networks

In large-scale heterogeneous P2P networks, it is indispensable to manage objects based on node’s capabilities. In order to achieve this end, capability-aware object management based on Skip List has been proposed. However, in this method, the number of hops for message routing increases as the number of nodes becomes large. In this paper, for the capability-aware object management, we propose a new message routing algorithm s in order to decrease the number of hops. In our proposed algorithm, additional node-information is included in a transmitting message and this information is used so that a node does not receive the same message doubly. Each node can use our proposed algorithm simply, and its implementation is easy. We evaluate the performance of the proposed method by simulation. Numerical examples show that the proposed method can decrease the average number of hops in any cases. In addition, the maximum number of hops decreases significantly when the number of nodes is large.